1101A - Minimum Integer - CodeForces Solution


math *1000

Please click on ads to support us..

Python Code:

import math  
def fin(f,g,h):
    if h<f:
        return h
    elif h>=f and h<g:
        if g%h !=0:
         return d*(math.ceil(g/d))
        else:
            return d*(math.ceil(g/d)+1)
    elif h==g:
        return h*2
    else:
        return h        
t= int(input())
for k in range(t):
    l , r , d = map(int,input().split())
    print(fin(l,r,d))

C++ Code:

#include <iostream>
#include <algorithm>
#include <math.h>
//#include <vector>
//#include <stack>
//#include <queue>
//#include <map>
//#include <set>
//#include <deque>
#define ll long long
#define pp pop_back
#define sz size()
#define N 100005
#define ff first
#define ss second
#define pb push_back
using namespace std;

int t, n, d, l, r;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> t;
	while ( t-- ) {
		cin >> l >> r >> d;
		if(l > d){
			cout << d << '\n';
		}
		else {
			cout << ((r/d)+1) * d << '\n';
		}
	}
}


Comments

Submit
0 Comments
More Questions

349B - Color the Fence
144A - Arrival of the General
1106A - Lunar New Year and Cross Counting
58A - Chat room
230A - Dragons
200B - Drinks
13A - Numbers
129A - Cookies
1367B - Even Array
136A - Presents
1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles